Cluster Computing: A Tool for Looking Before Leaping

نویسنده

  • James S Thorp
چکیده

Much power system behavior goes unstudied because it lies outside the conventional software environment of the industry. Large cascading outages, for example, are rare events and are not considered in reliability investigations. Experience in using a cluster to investigate cascading outages will be reported in which 160,000 major disturbances were produced for a 3000 bus system. Cluster applications for investigation of seams problems and examining the implication of different policies will be presented. The low cost ( $5.2 million) and the speed of Virginia Tech’s System X (the third fastest computer in the world as of November 2003) made up of 1100 Mac G5 computers suggests that we can now examine more versions of the future than previously believed possible.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Sequence of Hole-making Operations Using Particle Swarm Optimisation and Shuffled Frog Leaping Algorithm

Article history: Received: 14.5.2015. Received in revised form: 28.11.2015. Accepted: 1.12.2015. Tool travel and tool switch scheduling are two major issues in hole-making operations. It is necessary to find the optimal sequence of operations to reduce the total processing cost of hole-making operations. In this work therefore, an attempt is made to use both a recently developed particle swarm ...

متن کامل

Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process

In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...

متن کامل

$S$-Leaping: An adaptive, accelerated stochastic simulation algorithm, bridging $\tau$-leaping and $R$-leaping

We propose the S-leaping algorithm for the acceleration of Gillespie’s stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ -leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ -leaping is efficient for non-stiff systems or systems with partial equilibrium, while the R-leaping performs ...

متن کامل

Quasi-Monte Carlo methods applied to tau-leaping in stochastic biological systems

Quasi-Monte Carlo methods have proven to be effective extensions of traditional Monte Carlo methods in, amongst others, problems of quadrature and the sample path simulation of stochastic differential equations. By replacing the random number input stream in a simulation procedure by a low-discrepancy number input stream, variance reductions of several orders have been observed in financial app...

متن کامل

Parallel computing using MPI and OpenMP on self-configured platform, UMZHPC.

Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004